A New Technique to Uniquely Identify the Edges of a Graph
نویسندگان
چکیده
Graphs are useful for analysing the structure models in computer science, operations research, and sociology. The word metric dimension is basis of distance function, which has a symmetric property. Moreover, finding resolving set graph NP-complete, possibilities reduced due to behaviour graph. In this paper, we introduce idea edge-multiset graphs. A representation an edge defined as multiset distances between it vertices set, B⊆V(Γ). If two different edges unequal, then B Γ. least possible cardinality referred This article presents preliminary results, special conditions, bounds on certain research provides new insights into They could have implications developing algorithms, aircraft scheduling, species movement regions.
منابع مشابه
from linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولa synchronic and diachronic approach to the change route of address terms in the two recent centuries of persian language
terms of address as an important linguistics items provide valuable information about the interlocutors, their relationship and their circumstances. this study was done to investigate the change route of persian address terms in the two recent centuries including three historical periods of qajar, pahlavi and after the islamic revolution. data were extracted from a corpus consisting 24 novels w...
15 صفحه اولSome results on the complement of a new graph associated to a commutative ring
The rings considered in this article are commutative with identity which are not fields. Let R be a ring. A. Alilou, J. Amjadi and Sheikholeslami introduced and investigated a graph whose vertex set is the set of all nontrivial ideals of R and distinct vertices I, J are joined by an edge in this graph if and only if either ann(I)J = (0) or ann(J)I = (0). They called this graph as a new graph as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2023
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym15030762